#include <iostream>
#include <vector>
using namespace std;

int max_profit_dp(vector<int> &prices, int n, vector<vector<int>> &dp)
{
        dp[0][0] = 0;
        dp[0][1] = -prices[0];
        dp[0][2] = 0;
        dp[0][3] = -prices[0];
        dp[0][4] = 0;

        for(int i = 1; i < n; i++){
                dp[i][0] = dp[i - 1][0];
                dp[i][1] = max(dp[i - 1][1], dp[i - 1][0] - prices[i]);
                dp[i][2] = max(dp[i - 1][2], dp[i - 1][1] + prices[i]);
                dp[i][3] = max(dp[i - 1][3], dp[i - 1][2] - prices[i]);
                dp[i][4] = max(dp[i - 1][4], dp[i - 1][3] + prices[i]);
        }

        return dp[n - 1][4];
}

int main()
{
        int t;
        cin>>t;
        vector<int> prices(100005, 0);
        vector<vector<int>> dp(100005, vector<int>(5, 0));
        while(t--){
                int n;
                cin>>n;
                for(int i = 0; i < n; i++){
                        cin >> prices[i];
                }
                cout<<max_profit_dp(prices, n, dp)<<endl;
        }
        return 0;
}
/*
1
8
3 3 5 0 0 3 1 4
*/